An Eecient Algorithm to Compute Maximum Entropy Densities

An Efficient Algorithm To Compute Maximum Entropy Densities

An Algorithm to Compute the Complexity of a Static Production Planning (RESEARCH NOTE)

Complexity is one of the most important issues of any production planning. The increase in complexity of production planning can cause inconsistency between a production plan and an actual outcome. The complexity generally can be divided in two categories, the static complexity and the dynamic complexity, which can be computed using the ant ropy formula. The formula considers the probability of...

Probabilistic Logic Programming under Maximum Entropy Justus-liebig- Universit at Gieeen Ifig Research Report Probabilistic Logic Programming under Maximum Entropy

In this paper, we focus on the combination of probabilistic logic programming with the principle of maximum entropy. We start by deening probabilistic queries to probabilistic logic programs and their answer substitutions under maximum entropy. We then present an eecient linear programming characterization for the problem of deciding whether a probabilistic logic program is satissable. Finally,...

Adaptive On - Line Learning Algorithms for Blind Separation | Maximum Entropy and Minimum Mutual

There are two major approaches for blind separation: Maximum Entropy (ME) and Minimum Mutual Information (MMI). Both can be implemented by the stochastic gradient descent method for obtaining the de-mixing matrix. The MI is the contrast function for blind separation while the entropy is not. To justify the ME, the relation between ME and MMI is rstly elucidated by calculating the rst derivative...

Calculating Maximum-Entropy Probability densities for Belief Functions

A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a …nite set and let B be a belief function on 2 . Then B induces a density on 2 , which in turn induces a host of densities on S. Provide an algorithm for choosing from this host of densities one with maximum entropy.